Blind Identification of SFBC-OFDM Signals Using Subspace Decompositions and Random Matrix Theory
نویسندگان
چکیده
منابع مشابه
Matrix Decompositions Using sub-Gaussian Random Matrices
In recent years, several algorithms which approximate matrix decomposition have been developed. These algorithms are based on metric conservation features for linear spaces of random projection types. We present a new algorithm, which achieves with high probability a rank-r SVD approximation of an n × n matrix and derive an error bound that does not depend on the first r singular values. Althou...
متن کاملA Subspace Based Blind and Semi-blind Channel Identification Method for Ofdm Systems
A new subspace method performing the blind and semi-blind identification of the transmission channel suited to multicarrier systems with cyclic prefix (OFDM) is proposed in this paper. This technique has the advantage to preserve the classical OFDM emitter structure based on a cyclic prefix insertion. Therefore it applies to all existing standardized multicarrier systems (DAB, ADSL, etc.) and d...
متن کاملBlind system identification using minimum noise subspace
Developing fast and robust methods for identifying multiple FIR channels driven by an unknown common source is important for wireless communications, speech reverberation cancellation, and other applications. In this correspondence, we present a new method that exploits a minimum noise subspace (MNS). The MNS is computed from a set of channel output pairs that form a “tree.” The “tree” exploits...
متن کاملSubspace-Based Noise Reduction for Speech Signals via Diagonal and Triangular Matrix Decompositions: Survey and Analysis
We survey the definitions and use of rank-revealingmatrix decompositions in single-channel noise reduction algorithms for speech signals. Our algorithms are based on the rank-reduction paradigm and, in particular, signal subspace techniques. The focus is on practical working algorithms, using both diagonal (eigenvalue and singular value) decompositions and rank-revealing triangular decompositio...
متن کاملSubspace-Based Noise Reduction for Speech Signals via Diagonal and Triangular Matrix Decompositions∗
We survey the definitions and use of rank-revealing matrix decompositions in single-channel noise reduction algorithms for speech signals. Our algorithms are based on the rank-reduction paradigm and, in particular, signal subspace techniques. The focus is on practical working algorithms, using both diagonal (eigenvalue and singular value) decompositions and rankrevealing triangular decompositio...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Vehicular Technology
سال: 2018
ISSN: 0018-9545,1939-9359
DOI: 10.1109/tvt.2018.2859761